Англо-русский словарь промышленной и научной лексики. 2014.
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Chvátal graph — Named after Václav Chvátal Vertices 12 Edges 24 … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
List edge-coloring — In mathematics, list edge coloring is a type of graph coloring.More precisely, a list edge coloring is a choice function that maps every edge to a color from a prescribed list for that edge.A graph is k edge choosable if it has a proper list edge … Wikipedia
Graphe de Chvátal — Le graphe de Chvátal Nombre de sommets 12 Nombre d arêtes 24 Distribution des degrés 4 régulier Rayon 2 … Wikipédia en Français
